Factoring Gaussian precision matrices for linear dynamic models

نویسندگان

  • Joe Frankel
  • Simon King
چکیده

The linear dynamic model (LDM), also known as the Kalman filter model, has been the subject of research in the engineering, control, and more recently, machine learning and speech technology communities. The Gaussian noise processes are usually assumed to have diagonal, or occasionally full, covariance matrices. A number of recent papers have considered modelling the precision rather than covariance matrix of a Gaussian distribution, and this work applies such ideas to the LDM. A Gaussian precision matrix P can be factored into the form P = UT SU where U is a transform and S a diagonal matrix. By varying the form of U , the covariance can be specified as being diagonal or full, or used to model a given set of spatial dependencies. Furthermore, the transform and scaling components can be shared between models, allowing richer distributions with only marginally more parameters than required to specify diagonal covariances. The method described in this paper allows the construction of models with an appropriate number of parameters for the amount of available training data. We provide illustrative experimental results on synthetic and real speech data in which models with factored precision matrices and automatically-selected numbers of parameters are as good as or better than models with diagonal covariances on small data sets and as good as models with full covariance matrices on larger data sets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scalable Parallel Factorizations of SDD Matrices and Efficient Sampling for Gaussian Graphical Models

Motivated by a sampling problem basic to computational statistical inference, we develop a nearly optimal algorithm for a fundamental problem in spectral graph theory and numerical analysis. Given an n × n SDDM matrix M, and a constant −1 ≤ p ≤ 1, our algorithm gives efficient access to a sparse n× n linear operator C̃ such that M p ≈ C̃C̃ ⊤ . The solution is based on factoring M into a product of...

متن کامل

Comparative Study of Random Matrices Capability in Uncertainty Detection of Pier’s Dynamics

Because of random nature of many dependent variables in coastal engineering, treatment of effective parameters is generally associated with uncertainty. Numerical models are often used for dynamic analysis of complex structures, including mechanical systems. Furthermore, deterministic models are not sufficient for exact anticipation of structure’s dynamic response, but probabilistic models...

متن کامل

Efficient Sampling for Gaussian Graphical Models via Spectral Sparsification

Motivated by a sampling problem basic to computational statistical inference, we develop a toolset based on spectral sparsification for a family of fundamental problems involving Gaussian sampling, matrix functionals, and reversible Markov chains. Drawing on the connection between Gaussian graphical models and the recent breakthroughs in spectral graph theory, we give the first nearly linear ti...

متن کامل

Parameter Estimation in Spatial Generalized Linear Mixed Models with Skew Gaussian Random Effects using Laplace Approximation

 Spatial generalized linear mixed models are used commonly for modelling non-Gaussian discrete spatial responses. We present an algorithm for parameter estimation of the models using Laplace approximation of likelihood function. In these models, the spatial correlation structure of data is carried out by random effects or latent variables. In most spatial analysis, it is assumed that rando...

متن کامل

On the Reduction of Composed Relations from the Number Eld Sieve (extended Abstract)

In this paper we will present an algorithm which reduces the weight (the number of non zero elements) of the matrices that arise from the number eld sieve (NFS) for factoring integers 9] and computing discrete logarithm in IF p , where p is a prime ((3], 13]). In the so called Quadruple Large Prime Variation of NFS a graph algorithm computes sets of partial relations (relations with up to 4 lar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Pattern Recognition Letters

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2007